New Benchmark Instances for the Steiner Problem in Graphs
نویسندگان
چکیده
Let G = (V,E) be a connected undirected graph, where V is the set of nodes and E denotes the set of edges. Given a non-negative weight function w : E → IR+ associated with its edges and a subset X ⊆ V of terminal nodes, the Steiner problem in graphs (SPG) consists in finding a minimum weighted connected subtree of G spanning all terminal nodes in X . The solution of SPG is a Steiner minimum tree. This is one of the most widely studied NP-hard problems, with many applications.
منابع مشابه
A Partition-Based Heuristic for the Steiner Tree Problem in Large Graphs
This paper deals with a new heuristic for the Steiner tree problem (STP) in graphs which aims for the efficient construction of approximate solutions in very large graphs. The algorithm is based on a partitioning approach in which instances are divided into several subinstances that are small enough to be solved to optimality. A heuristic solution of the complete instance can then be constructe...
متن کاملThe Steiner tree problem with hop constraints
The Steiner tree problem in graphs is to determine a minimum cost subgraph of a given graph spanning a set of specified vertices. In certain telecommunication networks, additional constraints such as, e.g., reliability constraints, have to be observed. Assume that a certain reliability is associated with each arc of the network, measuring the probability that the respective arc is operational. ...
متن کاملKnowledge-guided local search for the prize-collecting Steiner tree problem in graphs
The prize-collecting Steiner tree problem in graphs (PCSPG), as well as its rooted variant (RPCST), are target problems of the 11th DIMACS (the Center for Discrete Mathematics and Theoretical Computer Science) Implementation Challenge held in collaboration with ICERM (the Institute for Computational and Experimental Research in Mathematics). To solve these two problems, this paper proposes a kn...
متن کاملReduction Techniques for the Prize-Collecting Steiner Tree Problem and the Maximum-Weight Connected Subgraph Problem
The concept of reduction has frequently distinguished itself as a pivotal ingredient of exact solving approaches for the Steiner tree problem in graphs. In this paper we broaden the focus and consider reduction techniques for three Steiner problem variants that have been extensively discussed in the literature and entail various practical applications: The prize-collecting Steiner tree problem,...
متن کاملLayered Graph Approaches to the Hop Constrained Connected Facility Location Problem
Given a set of customers, a set of potential facility locations and some inter-connection nodes, the goal of the Connected Facility Location problem (ConFL) is to find the minimum-cost way of assigning each customer to exactly one open facility, and connecting the open facilities via a Steiner tree. The sum of costs needed for building the Steiner tree, facility opening costs and the assignment...
متن کامل